A hybrid metaheuristic algorithm to solve the Capacitated m-Ring Star Problem
نویسندگان
چکیده
This work presents a metaheuristic approach to solve the Capacitated m-Ring Star Problem (CmRSP), a problem introduced by Baldacci et al. [1] which models the design of telecommunication networks with survivability properties. The CmRSP consists of finding a set of m cycles (rings), each of them including the central depot (the central telephone office), a subset of customers, and a set of optional nodes (secondary stations) used to diminish the costs of the network design. The rings must be node-disjoint (except for the central depot) in order to provide survivability to the network when node failure occurs. Customers that are not part of the rings must be directly connected to nodes in the rings. An additional constraint is that no ring (the cycle itself and pendants) can have more than Q customers, being Q a prefixed parameter (the ring capacity). The objective is to minimize the sum of routing and connection costs. The CmRSP is a NP-Hard problem, since it generalizes the Traveling Salesman Problem.
منابع مشابه
Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application
The urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. Also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). In fact, making slight improvements in this issue lead to a huge saving in municipal consumption. Some inci...
متن کاملAn Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy Demands
In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...
متن کاملThree Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing
This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...
متن کامل